Hopf measuring comonoids and enrichment

We study the existence of universal measuring comonoids $P(A,B)$ for a pair of monoids $A$, $B$ in a braided monoidal closed category, and the associated enrichment of a category of monoids over the monoidal category of comonoids. In symmetric categories, we show that if $A$ is a bimonoid and $B$ is a commutative monoid, then $P(A,B)$ is a bimonoid; in addition, if $A$ is a cocommutative Hopf monoid then $P(A,B)$ always is Hopf. If $A$ is a Hopf monoid, not necessarily cocommutative, then $P(A,B)$ is Hopf if the fundamental theorem of comodules holds; to prove this we give an alternative description of the dualizable $P(A,B)$-comodules and use the theory of Hopf (co)monads. We explore the examples of universal measuring comonoids in vector spaces and graded spaces.Comment: 30 pages. Version 2: re-arrangement of material; expansion of previous section 6, splitting into current sections 6,7,8; fix of graded algebras example, section 11; appendix removed; other minor fixes and edit

The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads

Lawvere theories and monads have been the two main category theoretic formulations of universal algebra, Lawvere theories arising in 1963 and the connection with monads being established a few years later. Monads, although mathematically the less direct and less malleable formulation, rapidly gained precedence. A generation later, the definition of monad began to appear extensively in theoretical computer science in order to model computational effects, without reference to universal algebra. But since then, the relevance of universal algebra to computational effects has been recognised, leading to renewed prominence of the notion of Lawvere theory, now in a computational setting. This development has formed a major part of Gordon Plotkin’s mature work, and we study its history here, in particular asking why Lawvere theories were eclipsed by monads in the 1960’s, and how the renewed interest in them in a computer science setting might develop in future

Glueing and Orthogonality for Models of Linear Logic

We present the general theory of the method of glueing and associated technique of orthogonality for constructing categorical models of all the structure of linear logic: in particular we treat the exponentials in detail. We indicate simple applications of the methods and show that they cover familiar examples.

Genre, discipline and identity

In Genre Analysis Swales encouraged us to see genres in terms of the communities in which they are used and as a function of the choices and constraints acting on text producers. It is this sensitivity to community practices which make genre a rich source of insights into two key concepts of the social sciences – community and identity. In this paper I take up these themes to explore the relationships between community expectations and the individual writer. To do so I use a corpus approach to recover evidence for repeated patterns of language which encode disciplinary preferences for different points of view, argument styles, attitudes to knowledge, and relationships between individuals and between individuals and ideas. The paper attempts to show how genre can offer insights into the ways actors understand both the here-and now interaction (the context of situation) and the broader constraints of the wider community which influence that interaction (the context of culture), revealing something of actors' orientations to scholarly communities and the ways they stake out individual positions

Pseudo-commutative Monads

AbstractWe introduce the notion of pseudo-commutative monad together with that of pseudo-closed 2-category, the leading example being given by the 2-monad on Cat whose 2-category of algebras is the 2-category of small symmetric monoidal categories. We prove that for any pseudo-commutative 2-monad on Cat, its 2-category of algebras is pseudo-closed. We also introduce supplementary definitions and results, and we illustrate this analysis with further examples such as those of small categories with finite products, and examples arising from wiring, interaction, contexts, and the logic of Bunched Implication

Lineales

The first aim of this note is to describe an algebraic structure, more primitive than lattices and quantales, which corresponds to the intuitionistic flavour of Linear Logic we prefer. This part of the note is a total trivialisation of ideas from category theory and we play with a toy-structure a not distant cousin of a toy-language. The second goal of the note is to show a generic categorical construction, which builds models for Linear Logic, similar to categorical models GC of [deP1990], but more general. The ultimate aim is to relate different categorical models of linear logic

Categorical Combinatorics for Innocent Strategies

International audienceWe show how to construct the category of games and innocent strategies from a more primitive category of games. On that category we define a comonad and monad with the former distributing over the latter. Innocent strategies are the maps in the induced two-sided Kleisli category. Thus the problematic composition of innocent strategies reflects the use of the distributive law. The composition of simple strategies, and the combinatorics of pointers used to give the comonad and monad are themselves described in categorical terms. The notions of view and of legal play arise naturally in the explanation of the distributivity. The category-theoretic perspective provides a clear discipline for the necessary combinatorics